Multiword atomic read/write registers on multiprocessor systems
نویسندگان
چکیده
منابع مشابه
Specifications , Refinements , and Atomic Registers
Sequential programs and algorithms are usually specified by means of preconditions and postconditions. This is not possible for concurrent and reactive programs, since their behaviour during execution is more interesting than their final states, even when termination is desirable. There are two schools in the way behaviours of concurrent and reactive programs are described. In the process algeb...
متن کاملAtomic Snapshots from Small Registers
Existing n-process implementations of atomic snapshots from registers use large registers. We consider the problem of implementing an m-component snapshot from small, Θ(log n)-bit registers. A natural solution is to consider simulating the large registers. Doing so straightforwardly can significantly increase the step complexity. We introduce the notion of an interruptible read and show how it ...
متن کاملCrash Resilient and Pseudo-Stabilizing Atomic Registers
We propose a crash safe and pseudo-stabilizing algorithm for implementing an atomic memory abstraction in a message passing system. Our algorithm is particularly appealing for multi-core architectures where both processors and memory contents (including stale messages in transit) are prone to errors and faults. Our algorithm extends the classical fault-tolerant implementation of atomic memory t...
متن کاملTask Distributions on Multiprocessor Systems
We consider the problem of scheduling of n independent jobs on m unrelated machines to minimize the max(t1, t2, ..., tm), ti being the completion time of machine i. In [1] was suggested a polynomial 2approximation algorithm for this problem. It was also proved that there can exist no polynomial 1.5-approximation algorithm unless P = NP . Here we improve this earlier performance bound 2 to 2− 1 ...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2009
ISSN: 1084-6654,1084-6654
DOI: 10.1145/1412228.1455262